Automatic Detection and Resolution of Lexical Ambiguity in Process Models
نویسندگان
چکیده
منابع مشابه
Automatic Detection and Resolution of Lexical Ambiguity in Process Models (Extended Abstract)
Process models play an important role in various system-related management activities including requirements elicitation, domain analysis, software design as well as documentation of databases, business processes, and software systems. However, it has been found that the correct and meaningful usage of process models appears to be a challenge in practical settings requiring the usage of automat...
متن کاملChronometric Studies of Lexical Ambiguity Resolution
Languages such as English contain a large number of words with multiple meanings. These words are commonly termed "lexlcal ambiguities", although it is probably more accurate to speak of them as potentially ambiguous. Determining how the contextually appropriate reading of a word is identified presents an important and unavoidable problem for persons developing theories of natural language proc...
متن کاملLexical Nature of Syntactic Ambiguity Resolution
Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms . An alternative account is provided in which both types of ambiguity derive from aspects of lexical representation and are resolved by the same processing mechanisms . Reinte...
متن کاملAutomatic Term Ambiguity Detection
While the resolution of term ambiguity is important for information extraction (IE) systems, the cost of resolving each instance of an entity can be prohibitively expensive on large datasets. To combat this, this work looks at ambiguity detection at the term, rather than the instance, level. By making a judgment about the general ambiguity of a term, a system is able to handle ambiguous and una...
متن کاملAutomatic ambiguity detection
Most work on sense disambiguation presumes that one knows beforehand — e.g. from a thesaurus — a set of polysemous terms. But published lists invariably give only partial coverage. For example, the English word tan has several obvious senses, but one may overlook the abbreviation for tangent. In this paper, we present an algorithm for identifying interesting polysemous terms and measuring their...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2015
ISSN: 0098-5589,1939-3520
DOI: 10.1109/tse.2015.2396895